Set-Codes with Small Intersections and Small Discrepancies
نویسندگان
چکیده
منابع مشابه
Locally Testable Codes and Small-Set Expanders
The unique games conjecture has been a very influential conjecture with many striking and profound implications. Originally proposed by Khot [Kho02], a positive resolution to the conjecture, would imply that many natural and important questions can be approximated by a basic SDP algorithm (see [Rag08]) and that no algorithm can do better (unless P = NP ). Many important practical problems such ...
متن کاملSmall polygons and toric codes
We describe two different approaches to making systematic classifications of plane lattice polygons, and recover the toric codes they generate, over small fields, where these match or exceed the best known minimum distance. This includes a [36, 19, 12]-code over F7 whose minimum distance 12 exceeds that of all previously known codes.
متن کاملCodes of Small Defect
The parameters of a linear code C over GF(q) are given by [n, k, d], where n denotes the length, k the dimension and d the minimum distance of C . The code C is called MDS, or maximum distance separable, if the minimum distance d meets the Singleton bound, i.e. d = n−k+1. Unfortunately, the parameters of an MDS code are severely limited by the size of the field. Thus we look for codes which hav...
متن کاملCodes from surfaces with small Picard number
Extending work of M. Zarzar, we evaluate the potential of Goppa-type evaluation codes constructed from linear systems on projective algebraic surfaces with small Picard number. Putting this condition on the Picard number provides some control over the numbers of irreducible components of curves on the surface and hence over the minimum distance of the codes. We find that such surfaces do not au...
متن کامل∊-MSR codes with small sub-packetization
Minimum storage regenerating (MSR) codes form a special class of maximum distance separable (MDS) codes by providing mechanisms for exact regeneration of a single code block in their codewords by downloading the minimum amount of information from the remaining code blocks. As a result, the MSR codes find application to distributed storage systems to enable node repairs with the optimal repair b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/19m1241106